Equational Properties of Mobile Ambients

نویسندگان

  • Andrew D. Gordon
  • Luca Cardelli
چکیده

The ambient calculus is a process calculus for describing mobile com putation We develop a theory of Morris style contextual equivalence for proving properties of mobile ambients We prove a context lemma that allows derivation of contextual equivalences by considering contexts of a particular limited form rather than all arbitrary contexts We give an activity lemma that characterizes the possible interactions between a pro cess and a context We prove several examples of contextual equivalence The proofs depend on characterizing reductions in the ambient calculus in terms of a labelled transition system

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Reduction Semantics for the Push and Pull Ambient Calculus

Honda and Yoshida showed how to obtain a meaningful equivalence on processes in the asynchronous -calculus using equational theories identifying insensitive processes. We apply their approach to a dialect of Cardelli and Gordon’s Mobile Ambients. The version we propose here is the Push and Pull Ambient Calculus, where the operational semantics is no longer defined in terms of ambients entering ...

متن کامل

On Reduction Semantics for the Push and Pull Ambitent Calculus

Honda and Yoshida showed how to obtain a meaningful equivalence on processes in the asynchronous -calculus using equational theories identifying insensitive processes. We apply their approach to a dialect of Cardelli and Gordon’s Mobile Ambients. The version we propose here is the Push and Pull Ambient Calculus, where the operational semantics is no longer defined in terms of ambients entering ...

متن کامل

Timed Mobile Ambients for Network Protocols

Ambient calculus is a calculus for mobile computing able to express local communications inside hierarchical domains. So far the timing properties have not been considered in the framework of mobile ambients. We add timers to capabilities and ambients, and provide an operational semantics of the new calculus. Certain results are related to the passage of time, and some new behavioural equivalen...

متن کامل

Translating Mobile Ambients into P Systems

We present a translation of the mobile ambients without communication and replication into P systems with mobile membranes. We introduce a set of developmental rules over membranes, and describe the correspondence between the behaviour of an ambient and the evolution of the its translated membrane system. We give an operational correspondence result between the mobile ambients and P systems. So...

متن کامل

Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting

In this paper we investigate the connection between fragments of Associative-Commutative Term Rewriting and fragments of Mobile Ambients, a powerful model for mobile and distributed computations. The connection can be used to transfer decidability and undecidability results for important computational properties like reachability from one formalism to the other. Furthermore, it can be viewed as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1999